Lifting for conic mixed-integer programming
نویسندگان
چکیده
منابع مشابه
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities formixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very effective in developing strong valid inequalities for linear integer programming and it has been successfully used to solve such problems with branch-and-cut algorithms. Here we generalize the theory of lifting to conic i...
متن کاملCuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming. Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructure...
متن کاملSequence Independent Lifting for Mixed-Integer Programming
Lifting is a procedure for deriving strong valid inequalities for a closed set from inequalities that are valid for its lower dimensional restrictions. It is arguably one of the most effective ways of strengthening linear programming relaxations of 0–1 programming problems. Wolsey (1977) and Gu et al. (2000) show that superadditive lifting functions lead to sequence independent lifting of valid...
متن کاملSequence Independent Lifting in Mixed Integer Programming
We investigate lifting i e the process of taking a valid inequality for a polyhe dron and extending it to a valid inequality in a higher dimensional space Lifting is usually applied sequentially that is variables in a set are lifted one after the other This may be computationally unattractive since it involves the solution of an optimization problem to compute a lifting coe cient for each varia...
متن کاملExtended formulations in mixed integer conic quadratic programming
In this paper we consider the use of extended formulations in LP-based algorithms for mixed integer conic quadratic programming (MICQP). Through an homogenization procedure we generalize an existing extended formulation to general conic quadratic constraints. We then compare its effectiveness against traditional and extended formulation-based algorithms for MICQP. We find that this new extended...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2009
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-009-0282-9